random point造句
例句與造句
- An innovative interpolation for random points
一種離散點插值的新算法 - Generating random points in triangles . in graphics gems , andrew s glassner ed . , boston : academic press , 1990 , pp . 24 - 28
那些已經(jīng)被松弛過的并且已經(jīng)形成穩(wěn)定的細胞分布的面片，將從松弛列表里刪除。 - The ba - zi and feng - shui are the means of random point from yi - jing , as well as a description of yin - yang theory
中國的八字風(fēng)水也是從易經(jīng)出來的以點為時空切入而進行軌跡評點的方式方法，也是陰陽之理的一種表述。 - Can be generated from seemingly random points in the execution of code , often in places from which an exception is not expected to arise
從代碼執(zhí)行中表面上的隨機點（往往是那些本不應(yīng)該引發(fā)異常的位置）可能會生成 - The second algorithm compute 2k p directly from p , where p is a random point on an elliptic curve , without computing the intermediate points , which is faster than k repeated doublings
該算法從p直接計算2 ~ kp ，不需要計算中介點，因此較k次倍乘快，其實現(xiàn)效率與投射坐標(biāo)下的算法相當(dāng)。 - It's difficult to find random point in a sentence. 用random point造句挺難的
- Level 1 - fires a ball of shrapnel into the air above the sniper , which promptly explodes into 8 pellets which shower random points in the target area for 10 - 35 physical damage in a 200 area of effect
一級-往空中發(fā)射一發(fā)榴彈，隨機向目標(biāo)區(qū)域（范圍200 ）撒播8個爆炸性的彈片，每個彈片造成10 - 35點的物理傷害。 - Level 3 - fires a ball of shrapnel into the air above the sniper , which promptly explodes into 16 pellets which shower random points in the target area for 10 - 35 physical damage in a 200 area of effect
三級-往空中發(fā)射一發(fā)榴彈，隨機向目標(biāo)區(qū)域（范圍200 ）撒播16個爆炸性的彈片，每個彈片造成10 - 35點的物理傷害。 - Level 4 - fires a ball of shrapnel into the air above the sniper , which promptly explodes into 20 pellets which shower random points in the target area for 10 - 35 physical damage in a 200 area of effect
四級-往空中發(fā)射一發(fā)榴彈，隨機向目標(biāo)區(qū)域（范圍200 ）撒播20個爆炸性的彈片，每個彈片造成10 - 35點的物理傷害。 - Level 2 - fires a ball of shrapnel into the air above the sniper , which promptly explodes into 12 pellets which shower random points in the target area for 10 - 35 physical damage in a 200 area of effect
二級-往空中發(fā)射一發(fā)榴彈，隨機向目標(biāo)區(qū)域（范圍200 ）撒播12個爆炸性的彈片，每個彈片造成10 - 35點的物理傷害。 - Our improved methods make use of random point to blind the base point , they can resistant against simple power analysis attacks , differential power analysis attacks , refined power analysis attacks and zero - value point attack
改進后的signedodd - onlycomb算法和width - wnaf算法可以抵抗簡單能量分析攻擊、差分能量分析攻擊、改進的差分能量分析攻擊和零值點能量分析攻擊。 - The algorithm divides the data into groups by sampling the training data , initializing to a number of random points , and then running several iterations of the microsoft clustering algorithm using the expectation maximization clustering method
該算法可以對定型數(shù)據(jù)采樣，初始化為一些隨機點，然后使用expectation maximization ( em )聚類分析方法運行幾次microsoft聚類分析算法迭代，以此將數(shù)據(jù)分組。由于 - Fortunately , this pause is often so short to as to not be noticeable , but you could easily imagine how having an application pause at seemingly random points in time for seemingly random and lengthy durations could have a devastating effect on application responsiveness and throughput
幸運的是，這種暫停通常是很短的，很難察覺到，但是很容易想像，如果應(yīng)用程序在隨機的時刻出現(xiàn)隨機且較長時間的暫停，對應(yīng)用程序的響應(yīng)性和吞吐能力會有破壞性的影響。 - In this thesis , the basic problem of network security , some correlative protocols and cryptology are discussed at first , math theory in point is also studied . especially , a sort of new matrix method of solving quadratic equation over gf ( 2m ) is given , which is the key of selecting random point over elliptic curves . no better solution has been found in related literature in the world . compared with ieee p1363 ' s method , it is easy to implement the software and obtain high efficiency , etc . then the basic operation of elliptic curve is debated and the steps of finding secure curve and basis point over gf ( 2m ) are presented . moreover , the encryption and decryption schemes of the ecc are designed and the security problem of ecc is also considered . in the end , ecc by koblitz curves are implemented
文章首先討論了網(wǎng)絡(luò)安全基本問題、網(wǎng)絡(luò)安全協(xié)議和密碼學(xué)；對相關(guān)數(shù)學(xué)理論進行了研究，特別是給出了一種新的求解gf ( 2 ~ m )上二次方程的矩陣法，而它是選取橢圓曲線上的隨機點的關(guān)鍵步驟，和ieeep1363的方法相比，它有易于軟件實現(xiàn)、效率高等優(yōu)點，在國內(nèi)外相關(guān)文獻上還未見到更好的求解方法；接著討論了橢圓曲線的基本運算，進而給出了在gf ( 2 ~ m )上選取安全曲線及基點的步驟；文章還設(shè)計了橢圓曲線加密系統(tǒng)的加解密方案，討論了橢圓曲線系統(tǒng)的安全性問題。最后文章就koblitz曲線加密系統(tǒng)進行了軟件實現(xiàn)。 - The improved parallel algorithm for selecting the base point of ecc over gf ( p ) is implemented by 2m ( m n , m 1 ) processors , m circular buffers and one shared table , which comprises two sub - algorithms : parallel finding the random points of ecc and parallel judging whether or not the random point is the base point
采用2m ( m n , m 1 )個處理器、 m個循環(huán)緩存和一個公共表改進的gf ( p )上ecc的并行基點選取算法分兩步實現(xiàn):并行隨機點產(chǎn)生算法和并行基點判斷算法。